A Rigidity Criterion for Non-Convex Polyhedra

نویسنده

  • Jean-Marc Schlenker
چکیده

Let P be a (non necessarily convex) embedded polyhedron in R, with its vertices on an ellipsoid. Suppose that the interior of P can be decomposed into convex polytopes without adding any vertex. Then P is infinitesimally rigid. More generally, let P be a polyhedron bounding a domain which is the union of polytopes C1, · · · , Cn with disjoint interiors, whose vertices are the vertices of P . Suppose that there exists an ellipsoid which contains no vertex of P but intersects all the edges of the Ci. Then P is infinitesimally rigid. The proof is based on some geometric properties of hyperideal hyperbolic polyhedra.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rigidity of Circle Polyhedra in the 2-sphere and of Hyperideal Polyhedra in Hyperbolic 3-space

We generalize Cauchy’s celebrated theorem on the global rigidity of convex polyhedra in Euclidean 3-space E to the context of circle polyhedra in the 2-sphere S. We prove that any two convex and proper non-unitary c-polyhedra with Möbiuscongruent faces that are consistently oriented are Möbius-congruent. Our result implies the global rigidity of convex inversive distance circle packings in the ...

متن کامل

Cauchy Rigidity of C -polyhedra

We generalize Cauchy’s celebrated theorem on the global rigidity of convex polyhedra in Euclidean 3-space E to the context of circle polyhedra in the 2-sphere S. We prove that any two convex and bounded non-unitary c-polyhedra with Möbiuscongruent faces that are consistently oriented are Möbius-congruent. Our result implies the global rigidity of convex inversive distance circle packings as wel...

متن کامل

On the infinitesimal rigidity of weakly convex polyhedra

The main motivation here is a question: whether any polyhedron which can be subdivided into convex pieces without adding a vertex, and which has the same vertices as a convex polyhedron, is infinitesimally rigid. We prove that it is indeed the case for two classes of polyhedra: those obtained from a convex polyhedron by “denting” at most two edges at a common vertex, and suspensions with a natu...

متن کامل

Small deformations of polygons and polyhedra

We describe the first-order variations of the angles of Euclidean, spherical or hyperbolic polygons under infinitesimal deformations such that the lengths of the edges do not change. Using this description, we introduce a quadratic invariant on the space of first-order deformations of a polygon. For convex polygons, this quadratic invariant has a positivity property, leading to a new proof of t...

متن کامل

Infinitesimally Rigid Polyhedra. I. Statics of Frameworks

From the time of Cauchy, mathematicians have studied the motions of convex polyhedra, with the faces held rigid while changes are allowed in the dihedral angles. In the 1940s Alexandrov proved that, even with additional vertices along the natural edges, and with an arbitrary triangulation of the natural faces on these vertices, such polyhedra are infinitesimally rigid. In this paper the dual (a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete & Computational Geometry

دوره 33  شماره 

صفحات  -

تاریخ انتشار 2005